We present a new approach to enhancing Answer Set Programming (ASP) withConstraint Processing techniques which allows for solving interestingConstraint Satisfaction Problems in ASP. We show how constraints on finitedomains can be decomposed into logic programs such that unit-propagationachieves arc, bound or range consistency. Experiments with our encodingsdemonstrate their computational impact.
展开▼
